Internal Diffusion-Limited Aggregation: Parallel Algorithms and Complexity
نویسندگان
چکیده
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set of paths is complete for the complexity class CC, the subset of P characterized by circuits composed of comparator gates. CC-completeness is believed to imply that, in the worst case, growing a cluster of size n requires polynomial time in n even on a parallel computer. A parallel relaxation algorithm is presented that uses the fact that clusters are nearly spherical to guess the cluster from a given set of paths, and then corrects defects in the guessed cluster through a nonlocal annihilation process. The parallel running time of the relaxation algorithm for two-dimensional internal DLA is studied by simulating it on a serial computer. The numerical results are compatible with a running time that is either polylogarithmic in n or a small power of n. Thus the computational resources needed to grow large clusters are significantly less on average than the worst-case analysis would suggest. For a parallel machine with k processors, we show that random clusters in d dimensions can be generated in O((n/k + log k)n) steps. This is a significant speedup over explicit sequential simulation, which takes O(n) time on average. Finally, we show that in one dimension internal DLA can be predicted in O(log n) parallel time, and so is in the complexity class NC.
منابع مشابه
Internal Diffusion-limited Aggregation on Non-amenable Graphs
Abstract The stochastic growth model Internal Diffusion Limited Aggregation was defined in 1991 by Diaconis and Fulton. Several shape results are known when the underlying state space is the d-dimensional lattice, or a discrete group with exponential growth. We prove an extension of the shape result of Blachère and Brofferio for Internal Diffusion Limited Aggregation on a wide class of Markov c...
متن کاملD ec 1 99 6 Parallel Algorithm and Dynamic Exponent for Diffusion - limited Aggregation
A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel random-access machine (PRAM) model of parallel computation according to T ∼ L z , where L is the cluster size, T is the running time, and the algorithm uses a number ...
متن کامل1 v 1 9 S ep 1 99 6 Optimized parallel algorithm and dynamic exponent for diffusion - limited aggregation
A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the PRAM model of parallel computation according to T ∼ L z , where T is the running time and L the cluster size. It is argued that z = D − D 2 /3, where D is the fractal dimension and D 2 is t...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کامل